Area—Time optimal VLSI integer multiplier with minimum computation time

Time - and VLSI - Optimal Convex

Computing the convex hull of a planar set of points is one of the most extensively investigated topics in computational geometry. Our main contribution is to present the rst known general-case, time-and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Speciically, we show that for every choice of a positive integer constant c, the convex hull of a set of...

COMPARISON BETWEEN MINIMUM AND NEAR MINIMUM TIME OPTIMAL CONTROL OF A FLEXIBLE SLEWING SPACECRAFT

In this paper, a minimum and near-minimum time optimal control laws are developed and compared for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The control commands are considered as typical bang-bang with multiple symmetrical switches, the time optimal control solution for the rigid-body mode is obtained as a bang-bang function and app...

On the Minimum Computation Time of Functions

Constant Time Computation of Minimum Dominating Sets

Let G be a graph and let P (n) denote an element from a one-parameter family of graphs, such as a path of length n, a cycle of length n, or a complete binary tree of height n. We are concerned with determining minimum dominating sets of graphs of the form G P (n). Using dynamic programming and properties of finite state spaces, we show a constant time algorithm to produce a minimum dominating s...

High Speed Booth Encoded Multiplier By Minimising The Computation Time

Two’s complement multipliers are used in most of the applications. The computation time is important in two’s complement multiplier. The computation time gets decreased by reducing the number of gates. The reduction can be achieved by Modified Booth Encoded multiplier Technique. Two’s complement multipliers are used in wide range of applications like multimedia, 3D graphics, signal processing e...